AN EXTENSION OF THE MONTAGUE SEMANTICS by PHILIPPE DELSARTE and ANDRÉ THAYSE

نویسندگان

  • PHILIPPE DELSARTE
  • ANDRÉ THAYSE
چکیده

Several authors have pointed out some limitations inherent in Montague's approach to naturallanguage representation, and have attempted to remedy these limitations by working out suitable extensions of the Montague formalism. One of these limitations originates from the fact that logical connectives and modal operators can only be applied to formulae and not to arbitrary logical expressions, which stands in contradiction with the common practice of natural language where connectives and modalities can afTect expressions of various syntactic categories (and not only complete sentences). This paper introduces an extension of Montague's intensional logic that precisely addresses the problem just alluded to. The proposed extension is equipped with a well-defined 'Boolean semantics', analogous with the Keenan-Faltz semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Montague's Semantics and Boolean Semantics for Natural Language Representation

Naturallanguage processing constitutes the subfield of artificial intelligence which deals with the development of computer programs able to understand natural language. Montague's semantics and Boolean semantics attempt to apply some techniques of mathematical logic and of algebraic lattice theory respectively for the representation of natural language with a view to its automatic processing. ...

متن کامل

A Montagovian Generative Lexicon

Generative Lexical Semantics aims, among other things, to model cocompositional meanings that classical Montague semantics is unable to express. This paper outlines a simple extension of Montague semantics which amends the standard compositional mechanisms for the use of specific terms provided by the lexicon, in order to account for this theory. We hope that such a logical system would prove b...

متن کامل

Improved Delsarte Bounds via Extension of the Function Space

A spherical (n,N, α)-code is a set {x1, . . . ,xN} of unit vectors in R such that the pairwise angular distance betweeen the vectors is at least α. One tries to find codes which maximize N or α if the other two values are fixed. The kissing number problem asks for the maximum number k(n) of nonoverlapping unit balls touching a central unit ball in n-space. This corresponds to the special case o...

متن کامل

On the Compositional Extension Problem

A semantics may be compositional and yet partial, in the sense that not all well-formed expressions are assigned meanings by it. Examples come from both natural and formal languages. When can such a semantics be extended to a total one, preserving compositionality? This sort of extension problem was formulated in Hodges [9], and solved there in a particular case, in which the total extension re...

متن کامل

Natural Language Querying of Historical Data Bases

In this paper we examine the connection between two areas of semantics, namely the semantics of historical databases and the semantics of natural language querying, and link them together via a common view of the semantics of time. Since the target application domain is an historical database, we present the essential features of the Historical Relational Database Model (HRDM), an extension to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014